Fast 3 D Mesh Compression Using Shared Vertex Analysis
نویسنده
چکیده
© 2010 Euee Seon Jang et al. 163 A trend in 3D mesh compression is codec design with low computational complexity which preserves the input vertex and face order. However, this added information increases the complexity. We present a fast 3D mesh compression method that compresses the redundant shared vertex information between neighboring faces using simple first-order differential coding followed by fast entropy coding with a fixed length prefix. Our algorithm is feasible for low complexity designs and maintains the order, which is now part of the MPEG-4 scalable complexity 3D mesh compression standard. The proposed algorithm is 30 times faster than MPEG-4 3D mesh coding extension.
منابع مشابه
Geometry Compression of 3-D Mesh Models Using a Joint Prediction
In this letter, we address geometry coding of 3-D mesh models. Using a joint prediction, the encoder predicts vertex positions in the layer traversal order. After we apply the joint prediction algorithm to eliminate redundancy among vertex positions using both position and angle values of neighboring triangles, we encode those prediction errors using a uniform quantizer and an entropy coder. Th...
متن کاملSequential Mesh Coding Using Wave Partitioning
Recently, various three-dimensional(3-D) mesh coding schemes have been proposed to improve compression efficiency or error resilience. However, we need to consider both coding efficiency and error resilience when we send 3-D mesh data over bandwidth-limited transmission channels. In this paper, we propose a sequential mesh coding algorithm using the vertex pedigree based on the wave partitionin...
متن کاملTriangle Mesh Compression for Fast Rendering
Modern GIS(Geographic Information System) application programs and simulation systems have to handle large datasets for rendering. Currently three dimensional rendering hardware are facing a memory bus bandwidth bottleneck problem at the graphics pipeline. One general solution for this problem is to compress the static three dimensional geometry in a preprocessing phase. We present a new mesh c...
متن کاملAnalysing the Influence of Vertex Clustering on PCA-Based Dynamic Mesh Compression
The growth of computational power of contemporary hardware causes technologies working with 3D-data to expand. Examples of the use of this kind of data can be found in geography or gaming industry. 3D-data may not be only static, but also dynamic. One way of animated 3D-data representation is expressing them by ”dynamic triangle mesh”. This kind of data representation is usually voluminous and ...
متن کاملImpact of vertex clustering on registration-based 3D dynamic mesh coding
3D dynamic meshes are associated with voluminous data and need to be encoded for efficient storage and transmission. We study the impact of vertex clustering on registration-based dynamic mesh coding, where compact mesh motion representation is achieved by computing correspondences for the mesh segments from the temporal reference to obtain high compression performance. Clustering algorithms se...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010